The randomized complexity of initial value problems
نویسندگان
چکیده
We study the complexity of randomized solution of initial value problems for systems of ordinary differential equations (ODE). The input data are assumed to be γ-smooth (γ = r+% : the r-th derivatives satisfy a %-Hölder condition). Recently, the following almost sharp estimate of the order of the n-th minimal error was given by Kacewicz (Almost optimal solution of initial-value problems by randomized and quantum algorithms, J. Complexity 22 (2006), 676-690): c1n −γ−1/2 ≤ e n ≤ c2(ε)n , with an arbitrary ε > 0. We present a Taylor Monte Carlo method and show that it has error rate n, this way establishing the exact order of the randomized n-th minimal error.
منابع مشابه
Almost Optimal Solution of Initial-Value Problems by Randomized and Quantum Algorithms
We establish essentially optimal bounds on the complexity of initial-value problems in the randomized and quantum settings. For this purpose we define a sequence of new algorithms whose error/cost properties improve from step to step. These algorithms yield new upper complexity bounds, which differ from known lower bounds by only an arbitrarily small positive parameter in the exponent, and a lo...
متن کاملAlmost optimal solution of initial-value problems by randomized and quantum algorithms
We establish essentially optimal bounds on the complexity of initial-value problems in the randomized and quantum settings. We define for this purpose a sequence of new algorithms, whose error/cost properties improve from step to step. This leads to new upper complexity bounds, which differ from known lower bounds only by an arbitrarily small positive parameter in the exponent, and a logarithmi...
متن کاملComplexity of parametric initial value problems in Banach spaces
We consider initial value problems for parameter dependent ordinary differential equations with values in a Banach space and study their complexity both in the deterministic and randomized setting, for input data from various smoothness classes. We develop multilevel algorithms, investigate the convergence of their deterministic and stochastic versions, and prove lower bounds.
متن کاملRandomized and quantum algorithms yield a speed-up for initial-value problems
Quantum algorithms and complexity have recently been studied not only for discrete, but also for some numerical problems. Most attention has been paid so far to the integration problem, for which a speed-up is shown by quantum computers with respect to deterministic and randomized algorithms on a classical computer. In this paper we deal with the randomized and quantum complexity of initial-val...
متن کاملOn the Complexity of Parabolic Initial Value Problems with Variable Drift
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as for randomized (or Monte Carlo) algorithms, assuming that the drift coefficients and the potential vary in given function spaces. We use fundamental solutions (parametrix method) for equations with unbounded coefficient...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Complexity
دوره 24 شماره
صفحات -
تاریخ انتشار 2008